Link-disjoint Embedding of Complete Binary Trees into 3d-meshes with Dimension-ordered Routing
نویسندگان
چکیده
This paper is considered with the problem of embedding complete binary trees into 3-dimensional meshes using dimension-ordered routing with the primary concern of minimizing the link congestion. The authors showed that a complete binary tree with 2 1 nodes can be embedded into a 3-dimensional mesh with optimum size, 2 nodes, if the link congestion is two [7]. (More precisely, the link congestion of each dimension is two, two, and one if the dimension-ordered routing is used, and two, one, and one if the dimension-ordered routing is not imposed.) In this paper, we present a scheme to nd an embedding of a complete binary tree into a 3-dimensional mesh of size no larger than 1:27 times the optimum with link congestion one while using dimension-ordered routing.
منابع مشابه
On the Fault-tolerant Embeddings of Complete Binary Trees in Mesh Interconnection Networks
In this article, several schemes are proposed for embedding complete binary trees (CBT) into meshes. All of the proposed methods outperform those in the previous studies. First, a link congestion 1 embedding is achieved. Its expansion ratio is at the lowest level as we know now. Except for this superiority, it also provides another capability for fault tolerance to resist abnormal system faults...
متن کاملOptimal Dynamic Edge-Disjoint Embeddings of Complete Binary Trees into Hypercubes
The double-rooted complete binary tree is a complete binary tree where the path (of length ) between the children of the root is replaced by a path of length . It is folklore that the double-rooted complete binary tree is a spanning tree of the hypercube of the same size. Unfortunately, the usual construction of an embedding of a double-rooted complete binary tree into the hypercube does not pr...
متن کاملMultipath Node-Disjoint Routing with Backup List Based on the AODV Protocol
In recent years, routing has been the most focused area in ad hoc networks research. On-demand routing in particular, is widely developed in bandwidth constrained mobile wireless ad hoc networks because of its effectiveness and efficiency. Most proposed on-demand routing protocols are built and relied on single route for each data session. Whenever there is a link disconnection on the active ro...
متن کاملMulti-node Broadcasting in All-Ported 3-D Wormhole-Routed Torus Using Aggregation-then-Distribution Strategy
In this paper, we investigate the multi-node broadcasting problem in a 3-D torus, where there are an unknown number of s source nodes located at unknown positions each intending to broadcast a message of size m bytes to the rest of the network. The torus is assumed to use the all-port model and the popular dimension-ordered routing. Existing congestion-free results are derived based on finding ...
متن کاملOptimal Dynamic Embeddings of Complete Binary Trees into Hypercubes
It is folklore that the double-rooted complete binary tree is a spanning tree of the hypercube of the same size. Unfortunately, the usual construction of an embedding of a double-rooted complete binary tree into a hypercube does not provide any hint on how this embedding can be extended if each leaf spawns two new leaves. In this paper, we present simple dynamic embeddings of double-rooted comp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998